A construction of supermagic graphs
نویسنده
چکیده
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce a new construction of supermagic graphs using the special structure of their subgraphs. The supermagic complements of some bipartite graphs and joins of some graphs are presented.
منابع مشابه
On a Construction of Supermagic Graphs
Given two graphs G and H. The composition of G with H is the graph with vertex set V (G) × V (H) in which (u1, v1) is adjacent to (u2, v2) if and only if u1u2 ∈ E(G) or u1 = u2 and v1v2 ∈ E(H). In this paper, we prove that the composition of regular supermagic graph with a null graph is supermagic. With the help of this result we show that the composition of a cycle with a null graph is always ...
متن کاملOn Supermagic Regular Graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized.
متن کاملOn Magic and Supermagic Line Graphs
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.
متن کاملSupermagic graphs having a saturated vertex
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supe...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کامل